List-only Entity Linking
نویسندگان
چکیده
Traditional Entity Linking (EL) technologies rely on rich structures and properties in the target knowledge base (KB). However, in many applications, the KB may be as simple and sparse as lists of names of the same type (e.g., lists of products). We call it as List-only Entity Linking problem. Fortunately, some mentions may have more cues for linking, which can be used as seed mentions to bridge other mentions and the uninformative entities. In this work, we select the most linkable mentions as seed mentions and disambiguate other mentions by comparing them with the seed mentions rather than directly with the entities. Our experiments on linking mentions to seven automatically mined lists show promising results and demonstrate the effectiveness of our approach.1
منابع مشابه
Estimating the Parameters for Linking Unstandardized References with the Matrix Comparator
This paper discusses recent research on methods for estimating configuration parameters for the Matrix Comparator used for linking unstandardized or heterogeneously standardized references. The matrix comparator computes the aggregate similarity between the tokens (words) in a pair of references. The two most critical parameters for the matrix comparator for obtaining the best linking results a...
متن کاملCollective List-only Entity Linking: A Graph-based Approach
List-only entity linking is the task of mapping ambiguous mentions in texts to target 8 entities in a group of entity lists. Different from traditional entity linking task, which leverages rich 9 semantic relatedness in knowledge bases to improve linking accuracy, list-only entity linking can 10 merely take advantage of co-occurrences information in entity lists. State-of-the-art work utilizes ...
متن کاملThe Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution
This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...
متن کاملTAC Entity Linking by Performing Full-document Entity Extraction and Disambiguation
The paper describes the system submitted to TAC 2011 for the English entity linking task of the Knowledge Base Population track. Instead of focusing only on the provided target strings, this system extracts and disambiguates globally all entities from each target document and then maps the target string to one of the entities extracted from the document. The main features employed by the system...
متن کاملTHUNLP at TAC KBP 2011 in Entity Linking
Entity Linking is to link a name string from plain-text documents to the corresponding entry in given knowledge base. In this paper we demonstrate our entity linking system for TAC KBP 2011 Track. Our system implements pairwise and listwise learning to rank methods to create a ranking list of candidates with several kinds of features, including context similarity, term frequency, key entity ext...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017